Sparse networks with core-periphery structure

We propose a statistical model for graphs with core-periphery structure. give precise notion of what it means graph to have this structure, based on the sparsity properties subgraphs core and periphery nodes. present class sparse such properties, provide methods simulate from class, perform posterior inference. demonstrate that our can detect structure in simulated real-world networks.